The Complexity of Valued Constraint Satisfaction
نویسندگان
چکیده
We survey recent results on the broad family of problems that can be cast as valued constraint satisfaction problems. We discuss general methods for analysing the complexity of such problems, give examples of tractable cases, and identify general features of the complexity landscape.
منابع مشابه
Binarisation via Dualisation for Valued Constraints
Constraint programming is a natural paradigm for many combinatorial optimisation problems. The complexity of constraint satisfaction for various forms of constraints has been widely-studied, both to inform the choice of appropriate algorithms, and to understand better the boundary between polynomial-time complexity and NP-hardness. In constraint programming it is well-known that any constraint ...
متن کاملThe Complexity of Valued CSPs
We survey recent results on the broad family of problems that can be cast as valued constraint satisfaction problems (VCSPs). We discuss general methods for analysing the complexity of such problems, give examples of tractable cases, and identify general features of the complexity landscape. 1998 ACM Subject Classification F.1.3 Complexity Measures and Classes, G.1.6 Optimization
متن کاملAlgebraic Properties of Valued Constraint Satisfaction Problem
The Valued Constraint Satisfaction Problem is an optimisation version of CSP, where the constraints not only determine the allowed combinations of values, but also specify associated costs. The goal is to minimise the aggregate cost. Following Feder and Vardi, we assume that all constraints in an instance must belong to a fixed valued constraint language. We show that, while studying the comput...
متن کاملBinarisation for Valued Constraint Satisfaction Problems
We study methods for transforming valued constraint satisfaction problems (VCSPs) to binary VCSPs. First, we show that the standard dual encoding preserves many aspects of the algebraic properties that capture the computational complexity of VCSPs. Second, we extend the reduction of CSPs to binary CSPs described by Bulín et al. [LMCS’15] to VCSPs. This reduction establishes that VCSPs over a fi...
متن کاملNecessary conditions for tractability of valued CSPs
The connection between constraint languages and clone theory has been a fruitful line of research on the complexity of constraint satisfaction problems. In a recent result, Cohen et al. [SICOMP’13] have characterised a Galois connection between valued constraint languages and so-called weighted clones. In this paper, we study the structure of weighted clones. We extend the results of Creed and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Bulletin of the EATCS
دوره 113 شماره
صفحات -
تاریخ انتشار 2014